An infinite-game semantics for well-founded negation in logic programming
نویسندگان
چکیده
منابع مشابه
An infinite-game semantics for well-founded negation in logic programming
We present an infinite-game characterization of the well-founded semantics for functionfree logic programs with negation. Our game is a simple generalization of the standard game for negationless logic programs introduced by van Emden [M.H. van Emden, Quantitative deduction and its fixpoint theory, Journal of Logic Programming 3(1):37–53, 1986] in which two players, the Believer and the Doubter...
متن کاملWell Founded Semantics for Logic Programs with Explicit Negation
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics 22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised 11]. This relationship improves the cross{fertilization between logic programs and default theories, ...
متن کاملInfinite-game Semantics for Logic Programming Languages
This thesis focuses on the study of the semantics of logic programs and the development of infinite games of perfect information between two players, that capture this semantics. We define a game that, given a propositional logic program with negation and a ground atom that belongs to it, may have three possible results (win for any of the players or tie). The game is determined. Based on this,...
متن کاملInfinite Games and Well-Founded Negation
We present a new characterization of the well-founded semantics [vGRS91] using an infinite two-player game of perfect information) [GS53]. Our game generalizes the standard game for ordinary logic programming [vE86]. Our proof of correctness is based on a refined version of the game, with degrees of winning and losing, which, as we demonstrate, corresponds exactly to the infinite-valued charact...
متن کاملConstructive Negation Under the Well-Founded Semantics
Constructive negation derives constraint answers for non-ground negative literals. Its incorporation into query evaluation under the well-founded semantics introduces two problems. One is the detection of repeated sub-goals and the elimination of redundant answers, which is required in order to guarantee termination. The other is the interaction between constraint answers of non-ground negative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2008
ISSN: 0168-0072
DOI: 10.1016/j.apal.2007.10.004